Percolation-type Problems on Infinite Random Graphs
نویسندگان
چکیده
We study some percolation problems on the complete graph over N. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
منابع مشابه
Ramsey-type Results on Random Graphs
We prove some Ramsey-type theorems, where the colours are replaced by measurable subsets of a probability space. Such results can be also interpreted as percolation problems on N, the complete graph over N, without requiring any specific assumption on the probability, such as independency. In particular, we provide sharp estimates on the probability of finding an infinite clique or an infinite ...
متن کاملAverage properties of combinatorial problems and thermodynamics of spin models on graphs
The study of thermodynamic properties of classical spin models on infinite graphs naturally leads to consider the new combinatorial problems of random-walks and percolation on the average. Indeed, spin models with O n continuous symmetry present spontaneous magnetization only on transient on the average graphs, while models with discrete symmetry (Ising and Potts) are spontaneously magnetized o...
متن کاملun 2 00 1 percolation on finite graphs Itai Benjamini
Several questions and few answers regarding percolation on finite graphs are presented. The following is a note regarding the asymptotic study of percolation on finite transitive graphs. On the one hand, the theory of percolation on infinite graphs is rather developed, although still with many open problems (See [9]). On the other hand random graphs were deeply studied (see [7]). Finite transit...
متن کاملThe Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview
Benjamini, Lyons and Schramm (1999) considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. To address problems raised by those authors, we study simple random walk on the infinite percolation cluster in Cayley graphs of certain amenable groups known as “lamplighter groups”. We prove that zero speed for random walk on a lamplig...
متن کاملAnchored expansion, percolation and speed
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56–84] considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. In this paper we solve several problems raised by those authors. The anchored expansion constant is a variant of the Cheeger constant; its positivity implies positive lower speed for the...
متن کامل